Decidability of the Representation Extension Property for Finite Semigroups

نویسنده

  • KUNITAKA SHOJI
چکیده

We prove that the decision problem of whether or not a finite semigroup has the representation extension property is decidable. 1. The main theorem and preliminaries It is an immediate consequence of the normal form theorem for amalgamated free products of groups that every amalgam of groups embeds in some group. However, this result fails for semigroup amalgams: an early result of Kimura [6] shows that amalgams of semigroups do not necessarily embed in any semigroup (see also [4], Vol. II, page 138). More recently, Sapir [7] has shown that it is in fact undecidable whether an amalgam of (finite) semigroups embeds in any (finite) semigroup. A semigroup S is called an amalgamation base for semigroups if every amalgam of semigroups containing S as a subsemigroup embeds in some semigroup. It is natural to ask if it is decidable whether or not a finite semigroup is an amalgamation base. According to [3], we say that a semigroup S has the representation extension property if for any right S-set XS and any left S-set SM containing S as a left Ssubset, the canonical map: X → X⊗SM (x 7−→ x⊗1) is injective. Hall [5] proved that any semigroup which is an amalgamation base in the class of all semigroups has the representation extension property. In this paper we prove The Main Theorem. It is decidable whether or not a finite semigroup has the representation extension property. Let S be a semigroup. Let M be a nonempty set with a unitary and associative operation of S : S ×M −→ M((s, w) 7−→ sw), where S is the monoid obtained from S by adjoining a new identity 1. Then M is called a left S-set. Dually, a right S-set is defined. If a left S-set [resp. right S-set] M contains elements m1, · · · ,mn such that M = Sm1 ∪ · · · ∪ Smn [resp. M = m1S ∪ · · · ∪mnS], then we say that m1, · · · ,mn are generators of M . A relation ρ on a left [resp. right] S-set M is called an S-congruence if (m,m′) ∈ ρ and s ∈ S implies (sm, sm′) ∈ ρ [resp. (ms,m′s) ∈ ρ]. Let M,N be left [resp. Received by the editors July 1, 1998. 1991 Mathematics Subject Classification. Primary 20M10.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidability and Tameness in the Theory of Finite Semigroups

This is a survey of results of the profinite approach to decidability problems in the theory of finite semigroups.

متن کامل

Decidability of Cancellative Extension of Monoidal T-norm Based Logic

It is known that the monoidal t-norm based logic (MTL) and many of its schematic extensions are decidable. The usual way how to prove decidability of some schematic extension of MTL is to show that the corresponding class of algebras of truth values has the finite model property (FMP) or the finite embeddability property (FEP). However this method does not work for the extensions whose correspo...

متن کامل

THE DUALITY OF THE L?-REPRESENTATION ALGEBRA ?(S ) OF A FOUNDATION SEMIGROUP S AND FUNCTION ALGEBRAS

In the present paper for a large family of topological semigroups, namely foundation semigroups, for which topological groups and discrete semigroups are elementary examples, it is shown that ?(S) is the dual of a function algebra.

متن کامل

Tameness of The Pseudovariety Ls1

A class of finite semigroups V is said to be decidable if the membership problem for V has a solution, that is, if we can construct an algorithm to test whether a given semigroup lies in V. Decidability of pseudovarieties is not preserved by some of the most common pseudovariety operators, such as semidirect product, Mal’cev product and join [1, 17]. In particular Rhodes [17] has exhibited a de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000